An extended approach for lifting clique tree inequalities
نویسندگان
چکیده
We present a new lifting approach for strengthening arbitrary clique tree inequalities that are known to be facet defining for the symmetric traveling salesman problem in order to get stronger valid inequalities for the symmetric quadratic traveling salesman problem (SQTSP). Applying this new approach to the subtour elimination constraints (SEC) leads to two new classes of facet defining inequalities of SQTSP. For the special case of the SEC with two nodes we derive all known conflicting edges inequalities for SQTSP. Furthermore we extend the presented approach to the asymmetric quadratic traveling salesman problem (AQTSP).
منابع مشابه
The precedence constrained knapsack problem: Separating maximally violated inequalities
We consider the problem of separating maximally violated inequalities for the precedence constrained knapsack problem. Though we consider maximally violated constraints in general, special emphasis is placed on induced cover inequalities and induced clique inequalities. Our contributions include a new partial characterization of maximally violated inequalities, a new safe shrinking technique, a...
متن کاملExploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP -hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set problem can be easily transformed into a max-cut instance. Moreover, Laurent, Poljak, Rendl and others have shown that any convex set containing the cut polytope yields, via a suitable projection, a convex set containing t...
متن کاملCapacitated Trees , Capacitated Routing , and Associated
We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalityconstrained minimal spanning tree problem and the identical customer vehicle routing problem. For each of these problems, and for a forest relaxation of the minimal spanning tree problem, we introduce a number of new valid inequalities and specify conditions for ensuring when these inequalities ...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS The Quadratic Semi-Assignment Polytope
We study a polytope which arises from a mixed integer programming formulation of the quadratic semi-assignment problem. We introduce an isomorphic projection in order to transform the polytope to another essentially equivalent and tractable polytope. As a result, some basic polyhedral properties, such as the dimension, the affine hull, and the trivial facets, are obtained in quite a simple way....
متن کاملWeighted Target Set Selection on Social Networks
Viral marketing and influence maximization on social networks has become a problem of significant interest. We consider a problem in this setting referred to as the weighted target set selection (WTSS) problem. Earlier research focused on approximation algorithms for the unweighted case of the problem which is known to be NP-hard. Motivated by the desire to develop a better understanding of fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 30 شماره
صفحات -
تاریخ انتشار 2015